#include "dgraph.h"
#include <iostream>
using namespace std;
int main()
{
    vector<vector<int>> v {{1,2,2},{2,3,3},{3,1,1},{4,1,1},{4,3,3}};
    DGraph dg;
    for (auto p : v)
        dg.add_edge(p[0],p[1],p[2]);
    //vector<int> top = dg.topology_sort_vertices(3);
    //for(int i:top)   cout<<i<<endl;
    //v.erase(v.end()-1);
    /*for(auto vv:v){
        for(int p:vv)
            cout<<p<<" ";
        cout<<endl;
    }

    map<int,int> shortest = dg.dijkstra(4);
    for(auto p : shortest)
        cout<<p.first<<" "<<p.second<<endl;

    map<int,map<int,int>> d2=dg.floyd_warshall();
    for(auto pp : d2)
        for(auto p :pp.second)
        cout<<pp.first<<" "<<p.first<<" "<<p.second<<" " <<dg.pi2[pp.first][p.first] <<endl;
*/


}
